Polynomial hierarchy - PDFSEARCH.IO - Document Search Engine

Polynomial hierarchy
Results: 38

#	Item
21	The Complexity of Unions of Disjoint Sets Christian Glaßer∗, Alan L. Selman†, Stephen Travers‡, and Klaus W. Wagner∗ Abstract This paper is motivated by the open question whether the union of two disjoint NPcomp Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2006-11-08 15:58:52 Complexity classes Computability theory NP-complete problems Structural complexity theory Polynomial hierarchy NP PP Many-one reduction Oracle machine Theoretical computer science Computational complexity theory Applied mathematics
22	Communicating ASP and the Polynomial Hierarchy Kim Bauters1, , Steven Schockaert1, , Dirk Vermeir2 , and Martine De Cock1 1 Department of Applied Mathematics and Computer Science Add to Reading List Source URL: www.cwi.ugent.be Language: English - Date: 2011-07-25 12:41:03 Logic programming Complexity classes Structural complexity theory Boolean algebra Stable model semantics True quantified Boolean formula Answer set programming FO Polynomial hierarchy Theoretical computer science Computational complexity theory Applied mathematics
23	Redundancy in Complete Sets Christian Glaßer∗, A. Pavan†, Alan L. Selman‡, Liyu Zhang§ July 6, 2005 Abstract We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2005-07-07 14:54:47 Complexity classes Structural complexity theory Conjectures Mathematical optimization P versus NP problem PP NP Polynomial hierarchy P Theoretical computer science Computational complexity theory Applied mathematics
24	Autoreducibility, Mitoticity, and Immunity Christian Glaßer∗, Mitsunori Ogihara†, A. Pavan‡, Alan L. Selman§, Liyu Zhang¶ December 27, 2004 Abstract We show the following results regarding complete sets. Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2004-12-27 11:32:14 Complexity classes Structural complexity theory Mathematical optimization Probabilistic complexity theory NP PP Polynomial hierarchy PSPACE-complete P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
25	POLYNOMIAL HIERARCHY, BETTI NUMBERS AND A REAL ANALOGUE OF TODA’S THEOREM SAUGATA BASU AND THIERRY ZELL Abstract. Toda [36] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P# Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2010-06-16 13:44:12 Field theory Real algebraic geometry Algebraic geometry Real closed field Betti number Polynomial Algebraic variety Field Semialgebraic set Abstract algebra Mathematics Algebra
26	POLYNOMIAL HIERARCHY, BETTI NUMBERS AND A REAL ANALOGUE OF TODA’S THEOREM SAUGATA BASU AND THIERRY ZELL 1. Brief Description Toda proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the cl Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2010-06-16 13:35:58 Field theory Algebraic geometry Polynomial Field extension Field Computational complexity theory Betti number Finite field Number Abstract algebra Mathematics Algebra
27	A COMPLEX ANALOGUE OF TODA’S THEOREM SAUGATA BASU Abstract. Toda [28] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#P , namely the class of languages that can be decided Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2011-09-22 08:25:51 Applied mathematics Constructible universe Polynomial Time hierarchy theorem Algebraic geometry Real closed field Karp–Lipton theorem Constructible number Mathematics Structural complexity theory Abstract algebra
28	Pottsboro Intermediate School[removed]Schedule 4th Grade Cottingame Rm 7 x330 Goncalves Add to Reading List Source URL: www.pottsboroisd.org Language: English - Date: 2013-09-03 11:27:07 Hierarchy Polynomial hierarchy Structural complexity theory
29	Motivation (Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2010-03-02 07:15:36 Science Stephen Smale Computational complexity theory Blum–Shub–Smale machine Theory of computation Real algebraic geometry Hypercomputation Real computation Mathematics Theoretical computer science Algebraic geometry
30	(Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation Algorithmic Semi-algebraic Geometry Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2009-07-30 22:08:48 Structural complexity theory Algebraic geometry Blum–Shub–Smale machine Polynomial hierarchy NP Polynomial Prime number Stephen Smale Algorithm Theoretical computer science Mathematics Applied mathematics

UPDATE